A Simpler Expression for $K$th Nearest Neighbor Coincidence Probabilities

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

kth Nearest Neighbor Sampling in the Plane

Let B be a square region in the plane. We give an efficient algorithm that takes a set P of n points from B, and produces a set M ⊂ B with the property that the distance to the second nearest point in M approximates the distance to the kth nearest point of P . That is, there are constants α, β ∈ R such that for all x ∈ B, we have αdP,k(x) ≤ dM,2(x) ≤ βdP,k(x), where dM,2 and dP,k denote the sec...

متن کامل

Scaling Universalities of kth-Nearest Neighbor Distances on Closed Manifolds

Take N sites distributed randomly and uniformly on a smooth closed surface. We express the expected distance ŒDkN‘ from an arbitrary point on the surface to its kth-nearest neighboring site, in terms of the function Al‘ giving the area of a disc of radius l about that point. We then find two universalities. First, for a flat surface, where Al‘ = πl2, ŒDkN‘ is separable in k and N . All kt...

متن کامل

Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule

In many pattern classification problems, an estimate of the posterior probabilities (rather than only a classification) is required. This is usually the case when some confidence measure in the classification is needed. In this article, we propose a new posterior probability estimator. The proposed estimator considers the K-nearest neighbors. It attaches a weight to each neighbor that contribut...

متن کامل

Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects

With the proliferation of wireless communications and the rapid advances in technologies for tracking the positions of continuously moving objects, algorithms for efficiently answering queries about large numbers of moving objects increasingly are needed. One such query is the reverse nearest neighbor (RNN) query that returns the objects that have a query object as their closest object. While a...

متن کامل

a lattice based nearest neighbor classifier for anomaly intrusion detection

as networking and communication technology becomes more widespread, thequantity and impact of system attackers have been increased rapidly. themethodology of intrusion detection (ids) is generally classified into two broadcategories according to the detection approaches: misuse detection and anomalydetection. in misuse detection approach, abnormal system behavior is defined atfirst, and then an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Probability

سال: 1975

ISSN: 0091-1798

DOI: 10.1214/aop/1176996278